ON AN OPEN QUESTION OF RICCERI CONCERNING A NEUMANN PROBLEM
نویسندگان
چکیده
منابع مشابه
On a question of B.H. Neumann
The automorphism group of a free group Aut(Fk) acts on the set of generating k-tuples (g1, . . . , gk) of a group G. Higman showed that when k = 2, the union of conjugacy classes of the commutators [g1, g2] and [g2, g1] is an orbit invariant. We give a negative answer to a question of B.H. Neumann, as to whether there is a generalization of Higman’s result for k ≥ 3.
متن کاملPerspectives on an Open Question
Starting with the card game SET, we ask the question of how many cards should be laid on the table in order to guarantee the existence of a set. This question is inherently related to the maximum size of an independent set in F k 3 . Although some specific values are known, the open question resides in its asymptotic evaluation. We set up the question and then explore its meaning in the context...
متن کاملA Boundary Meshless Method for Neumann Problem
Boundary integral equations (BIE) are reformulations of boundary value problems for partial differential equations. There is a plethora of research on numerical methods for all types of these equations such as solving by discretization which includes numerical integration. In this paper, the Neumann problem is reformulated to a BIE, and then moving least squares as a meshless method is describe...
متن کاملOn a Question concerning Sharp Bases
A sharp base B is a base such that whenever (Bi)i<ω is an injective sequence from B with x ∈ i<ω Bi, then { ⋂ i<n Bi : n < ω} is a base at x. Alleche, Arhangel’skĭı and Calbrix asked: if X has a sharp base, must X × [0, 1] have a sharp base? Good, Knight and Mohamad claimed to construct an example of a Tychonoff space P with a sharp base such that P × [0, 1] does not have a sharp base. However,...
متن کاملOn an open question about the complexity of a dynamic spectrum management problem
In this paper we discuss the complexity of a dynamic spectrum management problem within a multi-user communication system with K users and N available tones. In this problem a common utility function is optimized. In particular, so called min-rate, harmonic mean and geometric mean utility functions are considered. The complexity of the optimization problems with these utility functions is alrea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Glasgow Mathematical Journal
سال: 2007
ISSN: 0017-0895,1469-509X
DOI: 10.1017/s0017089507003515